Generic rigidity percolation in two dimensions.

نویسندگان

  • Jacobs
  • Thorpe
چکیده

We study rigidity percolation for random central-force networks on the bondand site-diluted generic triangular lattice. Here, each site location is randomly displaced from the perfect lattice, removing any special symmetries. Using the pebble game algorithm, the total number of floppy modes are counted exactly, and exhibit a cusp singularity in the second derivative at the transition from a rigid to a floppy structure. The critical thresholds for bond and site dilution are found to be 0.6602060.0003 and 0.6975560.0003, respectively. The network is decomposed into unique rigid clusters, and we apply the usual percolation scaling theory. From finite size scaling, we find that the generic rigidity percolation transition is second order, but in a different universality class from connectivity percolation, with the exponents a520.4860.05, b50.17560.02, and n51.2160.06. The fractal dimension of the spanning rigid clusters and the spanning stressed regions at the critical threshold are found to be d f51.8660.02 and dBB51.8060.03, respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existence and Uniqueness of Infinite Components in Generic Rigidity Percolation

We consider a percolation configuration on a general lattice in which edges are included independently with probability p. We study the rigidity properties of the resulting configuration, in the sense of generic rigidity in d dimensions. We give a mathematically rigorous treatment of the problem, starting with a definition of an infinite rigid component. We prove that for a broad class of latti...

متن کامل

An Algorithm for Two-Dimensional Rigidity Percolation: The Pebble Game

Many important macroscopic properties of materials depend upon the number of microscopic degrees of freedom. The task of counting the number of such degrees of freedom can be computationally very expensive. We describe a new approach for this calculation which is appropriate for twodimensional, glass-like networks, building upon recent work in graph rigidity. This purely combinatorial algorithm...

متن کامل

Rigidity of the interface in percolation and random-cluster models

We study conditioned random-cluster measures with edge-parameter p and cluster-weighting factor q satisfying q ≥ 1. The conditioning corresponds to mixed boundary conditions for a spin model. Interfaces may be defined in the sense of Dobrushin, and these are proved to be ‘rigid’ in the thermodynamic limit, in three dimensions and for sufficiently large values of p. This implies the existence of...

متن کامل

Expansion for k-Core Percolation

The physics of k-core percolation pertains to those systems whose constituents require a minimum number of k connections to each other in order to participate in any clustering phenomenon. Examples of such a phenomenon range from orientational ordering in solid ortho-para H2 mixtures to the onset of rigidity in barjoint networks to dynamical arrest in glass-forming liquids. Unlike ordinary (k=1...

متن کامل

Percolation of the Loss of Tension in an Infinite Triangular Lattice

We introduce a new class of bootstrap percolation models where the local rules are of a geometric nature as opposed to simple counts of standard bootstrap percolation. Our geometric bootstrap percolation comes from rigidity theory and convex geometry. We outline two percolation models: a Poisson model and a lattice model. Our Poisson model describes how defects—holes is one of the possible inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics

دوره 53 4  شماره 

صفحات  -

تاریخ انتشار 1996